Computer-Aided Complexity Classification of Dial-a-Ride Problems
نویسندگان
چکیده
Cap Gemini Ernst & Young, P.O. Box 2575, 3500 GN Utrecht, The Netherlands CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands Mathematical Institute, Academy of Sciences of the Czech Republic, Žitná 25, CZ-11567 Praha 1, Czech Republic Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands [email protected] [email protected] [email protected] [email protected] [email protected]
منابع مشابه
Efficient feasibility testing for dial-a-ride problems
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specific location and delivered to a specific destination. Dial-a-ride problems differ from other routing and scheduling problems in that they typically involve service related constraints. It is common to have maximum wait ...
متن کاملOnline multi-server dial-a-ride problems
In an online dial-a-ride problem, a crew of servers has to process transportation requests as they arrive in real time. Possible objective functions include minimizing the makespan and minimizing the sum of completion times. We give competitive algorithms and negative results for several online dial-a-ride problems with multiple servers. Surprisingly, in some cases the competitive ratio is dram...
متن کاملOptimisation for the Ride-Sharing Problem: a Complexity-based Approach
The dial-a-ride problem is a classic challenge in transportation and continues to be relevant across a large spectrum of applications, e.g. door-to-door transportation services, patient transportation, etc. Recently a new variant of the dial-a-ride problem, called ride-sharing, has received attention due to emergence of the use of smartphone-based applications that support location-aware transp...
متن کاملGeorgia Institute of Technology Office of Contract Administration Sponsored Project Initiation
This report summarizes the results of an intensive study into the application of interactive heuristics in transportation systems design and analysis. Project results include (1) the development of new methodology to aid researchers and practitioners and (2).a set of computer codes which were used to test concepts and to demonstrate the potential usefulness of the approach. Human Aided Optimiza...
متن کاملEuler is Standing in Line Dial - a - Ride Problems with FIFO - Precedence - Constraints
In this paper we study algorithms for “Dial-a-Ride” transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to find a shortest transportation that serves all the jobs. This problem is known to be NP-hard even on trees. We consider the extension when precedence relations between the jobs with the same source ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFORMS Journal on Computing
دوره 16 شماره
صفحات -
تاریخ انتشار 2004